Dependent Types for Pragmatics

This paper proposes the use of dependent types for pragmatic phenomena such as pronoun binding and presupposition resolution as a type-theoretic alternative to formalisms such as Discourse Representation Theory and Dynamic Semantics.Comment: This version updates the paper for publication in LEU

Two kinds of procedural semantics for privative modification

In this paper we present two kinds of procedural semantics for privative modification. We do this for three reasons. The first reason is to launch a tough test case to gauge the degree of substantial agreement between a constructivist and a realist interpretation of procedural semantics; the second is to extend Martin-L ̈f’s Constructive Type Theory to privative modification, which is characteristic of natural language; the third reason is to sketch a positive characterization of privation

Amplification by stochastic interference

A new method is introduced to obtain a strong signal by the interference of weak signals in noisy channels. The method is based on the interference of 1/f noise from parallel channels. One realization of stochastic interference is the auditory nervous system. Stochastic interference may have broad potential applications in the information transmission by parallel noisy channels

An Editor for Helping Novices to Learn Standard ML

This paper describes a novel editor intended as an aid in the learning of the functional programming language Standard ML. A common technique used by novices is programming by analogy whereby students refer to similar programs that they have written before or have seen in the course literature and use these programs as a basis to write a new program. We present a novel editor for ML which supports programming by analogy by providing a collection of editing commands that transform old programs into new ones. Each command makes changes to an isolated part of the program. These changes are propagated to the rest of the program using analogical techniques. We observed a group of novice ML students to determine the most common programming errors in learning ML and restrict our editor such that it is impossible to commit these errors. In this way, students encounter fewer bugs and so their rate of learning increases. Our editor, C Y NTHIA, has been implemented and is due to be tested on st..

Characterization of quantum states in predicative logic

We develop a characterization of quantum states by means of first order variables and random variables, within a predicative logic with equality, in the framework of basic logic and its definitory equations. We introduce the notion of random first order domain and find a characterization of pure states in predicative logic and mixed states in propositional logic, due to a focusing condition. We discuss the role of first order variables and the related contextuality, in terms of sequents.Comment: 14 pages, Boston, IQSA10, to appea

Ω-Arithmetization of Ellipses

International audienceMulti-resolution analysis and numerical precision problems are very important subjects in fields like image analysis or geometrical modeling. In the continuation of our previous works, we propose to apply the method of Ω-arithmetization to ellipses. We obtain a discrete multi-resolution representation of arcs of ellipses. The corresponding algorithms are completely constructive and thus, can be exactly translated into functional computer programs. Moreover, we give a global condition for the connectivity of the discrete curves generated by the method at every scale

Higher Order Containers

Abstract. Containers are a semantic way to talk about strictly positive types. In previous work it was shown that containers are closed under various constructions including products, coproducts, initial algebras and terminal coalgebras. In the present paper we show that, surprisingly, the category of containers is cartesian closed, giving rise to a full cartesian closed subcategory of endofunctors. The result has interesting applications syntax. We also show that while the category of containers has finite limits, it is not locally cartesian closed.

Homotopy-initial algebras in type theory

We investigate inductive types in type theory, using the insights provided by homotopy type theory and univalent foundations of mathematics. We do so by introducing the new notion of a homotopy-initial algebra. This notion is defined by a purely type-theoretic contractibility condition which replaces the standard, category-theoretic universal property involving the existence and uniqueness of appropriate morphisms. Our main result characterises the types that are equivalent to W-types as homotopy-initial algebras

Algebraic totality, towards completeness

Finiteness spaces constitute a categorical model of Linear Logic (LL) whose objects can be seen as linearly topologised spaces, (a class of topological vector spaces introduced by Lefschetz in 1942) and morphisms as continuous linear maps. First, we recall definitions of finiteness spaces and describe their basic properties deduced from the general theory of linearly topologised spaces. Then we give an interpretation of LL based on linear algebra. Second, thanks to separation properties, we can introduce an algebraic notion of totality candidate in the framework of linearly topologised spaces: a totality candidate is a closed affine subspace which does not contain 0. We show that finiteness spaces with totality candidates constitute a model of classical LL. Finally, we give a barycentric simply typed lambda-calculus, with booleans ${\mathcal{B}}$ and a conditional operator, which can be interpreted in this model. We prove completeness at type ${\mathcal{B}}^n\to{\mathcal{B}}$ for every n by an algebraic method

The accuracy of merging approximation in generalized St. Petersburg games

Merging asymptotic expansions of arbitrary length are established for the distribution functions and for the probabilities of suitably centered and normalized cumulative winnings in a full sequence of generalized St. Petersburg games, extending the short expansions due to Cs\"org\H{o}, S., Merging asymptotic expansions in generalized St. Petersburg games, \textit{Acta Sci. Math. (Szeged)} \textbf{73} 297--331, 2007. These expansions are given in terms of suitably chosen members from the classes of subsequential semistable infinitely divisible asymptotic distribution functions and certain derivatives of these functions. The length of the expansion depends upon the tail parameter. Both uniform and nonuniform bounds are presented.Comment: 30 pages long version (to appear in Journal of Theoretical Probability); some corrected typo